The Graph Analysis Toolbox: Image Processing on Arbitrary Graphs
نویسندگان
چکیده
We present a theoretical and computational framework for the analysis of data associated with the node set of an arbitrary graph. The algorithms described here are collected in a MATLAB software package named the Graph Analysis Toolbox. Our purpose is to describe the functionality of the Graph Analysis Toolbox and the associated theoretical framework in the context of biologically inspired, space-variant computer vision.
منابع مشابه
On two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملOn zero-divisor graphs of quotient rings and complemented zero-divisor graphs
For an arbitrary ring $R$, the zero-divisor graph of $R$, denoted by $Gamma (R)$, is an undirected simple graph that its vertices are all nonzero zero-divisors of $R$ in which any two vertices $x$ and $y$ are adjacent if and only if either $xy=0$ or $yx=0$. It is well-known that for any commutative ring $R$, $Gamma (R) cong Gamma (T(R))$ where $T(R)$ is the (total) quotient ring of $R$. In this...
متن کاملJust chromatic exellence in fuzzy graphs
A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965cite{zl} and further studiedcite{ka}. It was Rosenfeldcite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975. The concepts of fuzzy trees, blocks, bridges and cut nodes in fuzzy graph has been studi...
متن کاملMathematical Morphology and Eikonal Equations on Graphs for Nonlocal Image and Data Processing
Mathematical morphology (MM) offers a wide range of operators to address various image processing problems. These operators can be defined in terms of algebraic (discrete) sets or as partial differential equations (PDEs). In this paper, we introduce a novel formulation of MM formalized as a framework of partial difference equations (PdEs) over weighted graphs of arbitrary topology. Then, we pre...
متن کاملOn strongly 2-multiplicative graphs
In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002